Systems and methods for random to sequential storage mapping

ABSTRACT

Systems and methods for mapping random data writes to sequential or semi-sequential storage. Data writes may be initially directed to an SSD or other relatively low latency and high IOPS data storage layer. The data may remain in the SSD storage layer until a group of data may be written, together, to a sequential or semi-sequential storage layer. A data organizer may group the data into data buckets based on tags and/or policies associated with the data. In this way, data subject to similar lifetime, priority, data protection, and/or other policies may be stored on a same segment or other portion of the sequential storage layer. Similarly, data having similar access patterns, authors, files, objects, or project affiliations, may be stored together on a same segment of the sequential storage layer.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims priority to U.S. Provisional ApplicationNo. 62/414,255, entitled Random Data to Sequential Storage Mapping, andfiled Oct. 28, 2016, the content of which is hereby incorporated byreference herein in its entirety.

FIELD OF THE INVENTION

The present disclosure relates to data handling and storage systems.Particularly, the present disclosure relates to systems and methods foroptimizing sequential storage. More particularly, the present disclosurerelates to systems and methods for mapping random data writes tosequential or semi-sequential storage.

BACKGROUND OF THE INVENTION

The background description provided herein is for the purpose ofgenerally presenting the context of the disclosure. Work of thepresently named inventors, to the extent it is described in thisbackground section, as well as aspects of the description that may nototherwise qualify as prior art at the time of filing, are neitherexpressly nor impliedly admitted as prior art against the presentdisclosure.

Data storage systems and data handling systems often use sequential, orsemi-sequential access storage media, such as that provided by shingledmagnetic recording (SMR) disk drives, low drive-write-per-day (DWPD)flash drives, key/value storage devices, and object stores. Whilesequential and semi-sequential storage media often provide relativelylow cost and high density storage options, these types of storagedevices can be relatively slow or inefficient. Sequential andsemi-sequential access storage media can have high latency times and/orlow input/output operations per second (IOPS). Moreover, such sequentialaccess media generally do not allow for random writes within a file,object, or address space. Instead, sequential storage is often writtenin zones of varying granularity, and modifications may require thatsurrounding data be simultaneously overwritten. Another type of datastorage device is a solid state drive (SSD). Solid state drives mayprovide relatively low latency times and/or high IOPS. However, SSDstorage is typically relatively high cost and low capacity. Accordingly,there is a need in the art for improved systems and methods for datastorage. More particularly, there is a need in the art for systems andmethods providing random to sequential storage mapping.

BRIEF SUMMARY OF THE INVENTION

The following presents a simplified summary of one or more embodimentsof the present disclosure in order to provide a basic understanding ofsuch embodiments. This summary is not an extensive overview of allcontemplated embodiments, and is intended to neither identify key orcritical elements of all embodiments, nor delineate the scope of any orall embodiments.

The present disclosure, in one or more embodiments, relates to a datastorage system having a first storage layer with a first type of storagedevice and a second storage layer with a second type of storage devicedifferent from the first type. The data storage system may additionallyhave an I/O manager directing incoming write requests to the firststorage layer, and a data organizer. The data organizer may organize thedata stored on the first storage layer into data buckets, wherein a databucket may include data having at least one similar attribute. Moreover,when a data bucket reaches a quota, the data organizer may move the datain the bucket from the first storage layer to the second storage layer.The first storage layer may include one or more solid state drives, suchas one or more flash storage devices. The second storage layer mayinclude one or more sequential or semi-sequential storage devices, suchas one or more shingled magnetic recording devices. Organizing the datastored on the first storage layer into data buckets may includereviewing one or more tags associated with the data to determine the atleast one similar attribute. Moreover, the at least one attribute mayrelate to a data lifetime policy, a data priority policy, a dataprotection policy, or temporal locality. In some embodiments, the I/Omanager may additionally direct incoming read requests to either of thefirst storage layer and the second storage layer, depending on where therelevant data is stored. The data organizer may additionally move datafrom the second storage layer to the first storage layer based on one ormore policies. In some embodiments, the data storage system may have asegment manager searching the second storage layer for available storagespace. The segment manager may maintain a record of available space onthe second storage layer.

The present disclosure, in one or more embodiments, additionally relatesto a method for storing data. The method may include receiving a writerequest for data, writing the data to a first storage layer having afirst type of storage device, grouping the data with data having atleast one similar attribute, and moving the grouped data to a secondstorage layer having a second type of storage device. In someembodiments, the method may additionally include performing a datapolicy operation with respect to the grouped data. Moreover, groupingthe data with data having at least one similar attribute may includeplacing the data in a data bucket based on one or more tags associatedwith the data. The one or more tags may relate to data lifetime policy,a data priority policy, a data protection policy, and/or temporallocality.

The present disclosure, in one or more embodiments, additionally relatesto a data handling system having an I/O manager directing incomingwrites to a first storage layer, the first storage layer having a firsttype of data storage device. The data handling system may additionallyhave a data organizer organizing the data stored on the first storagelayer into data buckets, wherein a data bucket includes data having atleast one similar attributes. When a data bucket reaches a quota, thedata organizer may move the data in the bucket from the first storagelayer to a second storage layer having a second type of data storagedevice different from the first type. In some embodiments, organizingthe data stored on the first storage layer into data buckets may includereviewing one or more tags associated with the data.

While multiple embodiments are disclosed, still other embodiments of thepresent disclosure will become apparent to those skilled in the art fromthe following detailed description, which shows and describesillustrative embodiments of the invention. As will be realized, thevarious embodiments of the present disclosure are capable ofmodifications in various obvious aspects, all without departing from thespirit and scope of the present disclosure. Accordingly, the drawingsand detailed description are to be regarded as illustrative in natureand not restrictive.

BRIEF DESCRIPTION OF THE DRAWINGS

While the specification concludes with claims particularly pointing outand distinctly claiming the subject matter that is regarded as formingthe various embodiments of the present disclosure, it is believed thatthe invention will be better understood from the following descriptiontaken in conjunction with the accompanying Figures, in which:

FIG. 1 is a conceptual diagram of a data storage system of the presentdisclosure, according to one or more embodiments.

FIG. 2 is a diagram of a data management system of the presentdisclosure, according to one or more embodiments.

FIG. 3 is a conceptual diagram of data grouping of the presentdisclosure, according to one or more embodiments.

FIG. 4 is a conceptual diagram of data bucket grouping of the presentdisclosure, according to one or more embodiments.

FIG. 5 is a flow diagram of a method of the present disclosure,according to one or more embodiments.

DETAILED DESCRIPTION

The present disclosure relates to novel and advantageous data storagesystems. Particularly, the present disclosure relates to novel andadvantageous systems and methods for mapping random data writes tosequential or semi-sequential storage. In some embodiments of thepresent disclosure, data writes may be initially directed to an SSD orother relatively low latency and high IOPS data storage layer. The datamay remain in the SSD storage layer until a group of data may bewritten, together, to a sequential or semi-sequential storage layer. Adata organizer may group the data into data buckets based on tags and/orpolicies associated with the data. In this way, data subject to similarlifetime, priority, data protection, and/or other policies may be storedon a same segment or other portion of the sequential storage layer.Similarly, data having similar access patterns, authors, files, objects,or project affiliations, may be stored together on a same segment of thesequential storage layer. The systems and methods of the presentdisclosure may leverage the relatively high speed and low latency of SSDstorage, together with the high efficiency and storage capacity ofsequential storage. The systems and methods described herein allowrandom access to sequential access mapping, particularly for relativelyhigh bandwidth applications and large data sets. Moreover, the systemsand methods described herein may provide for effective use of cloudstorage for elasticity and data movement.

Turning now to FIG. 1, a conceptual diagram showing one example of adata storage system 100 of the present disclosure is shown. The datastorage system 100 may have flash or SSD storage space 102, as well assequential storage space 104, such as SMR storage space. Write requestsfrom one or more clients 106 or other users may be received at, or sentfirst to, the flash storage 102. The individual writes may be written tothe flash storage 102 in a random access manner. That is, the writes maybe written to the flash storage 102 in the order they are received, orin any suitable order. The individual writes may remain in flash storage102 for any suitable period of time. In some embodiments, individualwrites may remain in flash storage 102 until enough writes may begrouped together to write a zone or segment of the sequential storagespace 104. As a particular example, SMR storage may be written inapproximately 256 MB zones or segments in some embodiments. When thereare enough writes in the flash storage 102 to write to a 256 MB segment,the data may be written together to the sequential storage 104. In otherembodiments, data may be written in zones or segments having any othersuitable size.

In some embodiments, data may be grouped into particular buckets beforeit is written to the sequential storage 104. For example, the datawrites stored in the flash storage 102 may be grouped based on metadataand/or other attributes about or associated with the data before beingwritten to the sequential storage 104. In some embodiments, the datawrites may be grouped based on tags associated with the data. Tags maybe labels or categories that are assigned to or associated withparticular files and/or objects. Tags may relate to various informationor attributes about the data. For example, in some embodiments, a tagmay identify frequently accessed data. Other tags may represent datathat is frequently used together or data that corresponds to a sameapplication, project, user, or other attribute, for example. Tags may bedefined manually by a user, such as a client or administrator. In someembodiments, tags may be defined automatically by a system, or partiallyautomatically based on one or more predefined parameters. In someembodiments, tags may relate to metadata. In general, tags may becustomizable, such that a client, administrator, or other user may tagdata based on any desired parameters or qualifications. Tags aredescribed in more detail in U.S. Patent Application entitled Systems andMethods for Data Management Using Zero-Touch Tagging, having AttorneyDocket No. 20486.5.0001.US.U2, filed the same day as the presentapplication on Oct, 27, 2017, and having U.S. patent application Ser.No. 15/795,882, the content of which is hereby incorporated by referenceherein in its entirety. In general, tags may be used to categorize orgroup data, such that a policy may be defined for all of the dataassociated with a particular tag or set of tags.

A policy may provide for one or more particular operations to beperformed with respect to associated data. For example, a policy mayrelate to data life, priority, protection, location, security, or otheroperations. As one particular example, a policy may provide that dataassociated with “Tag A” is to be deleted after 2 years. Another exampleof a policy is data associated with “Tag B” is to be moved to flashstorage on the last day of each month, and returned to sequentialstorage or other storage on the first day of each month. Policies arefurther described in U.S. patent application Ser. No. 15/795,882,previously incorporated by reference. In general, tags and policies maybe used to determine where a data write came from and/or how it is to beused.

Below are some examples of policies that may be used according tovarious embodiments of the present disclosure to determine how to groupdata together for storage purposes. In some embodiments, each policy maycorrespond with one or more tags.

-   -   Data Lifetime: A data lifetime policy may specify a length of        time that a data file or object should remain in a system.        Additionally or alternatively, a data lifetime policy may        designate when and how data should be moved between different        storage locations or classifications of storage. For example, a        lifetime policy may designate that data should be moved to        archive storage after two years in sequential storage. Data may        be grouped together by same or similar lifetime policies or        requirements because the data may be expected to be moved or        removed at a same time in accordance with the applicable        policies. For example, data subject to policies having a storage        period within a particular time range may be grouped together.        Similarly, data subject to policies having a transfer date        within a particular date range may be grouped together. In this        way, all of the data within the group may be moved or        transferred within the particular range, in accordance with the        policies.    -   Priority: A data priority policy may relate to an importance of        corresponding data and/or one or more performance needs for the        data. For example, high performance data may use more disks        and/or data storage space. In some embodiments, data priority        may be designated by one or more service level agreements. Data        may be grouped together by same or similar priority levels to        make more efficient use of data storage space. For example, data        subject to “high” priority policies may be grouped together.        Similarly, data subject to “medium” priority policies may be        grouped together, and data subject to “low” priority policies        may be grouped together. In some embodiments, data having medium        and low priority policies may be grouped together.    -   Data Protection: A data protection policy may relate to number        of disk failures, appliance failures, or system failures that        data may be configured to sustain. In some embodiments, data        protection may be designated by one or more service level        agreements. Data may be grouped together by same or similar        protection levels to make more efficient use of data storage        space. As a particular example, one data object may have a first        protection policy designating that the object should be        protected against two individual disk failures. This data object        may then be placed on space configured to survive two disk        failures while still serving the data. A second data object may        have a second protection policy designated that the second        object should be protected against two disk failures and an        appliance failure. The second object may then be placed on space        configured to survive those failures while still serving the        data. In some embodiments, the first and second objects may be        stored on the same disk space, but subject to different software        protection schemes. In general, data subject to policies        dictating a same number of disk failures, appliance, failures,        system failures, and/or other protection parameters may be        grouped together in storage space configured for such data        protection.    -   Temporal Locality: In some embodiments, data may be grouped        based on temporal locality. Temporal locality may be defined by        a policy, or may relate to metadata or tags associated with data        writes. This type of policy, tagging, or grouping may assume        that data written within a relatively short period of time may        likely be related, and may be accessed together. Temporal        locality may be determined, for example, based on when data is        received in the system. Data received within a relatively short        time range or date range may be grouped together. Similarly,        temporal locality may be based on data creation date. Data        having creation dates within a relatively short time range or        date range may be grouped together.    -   Compression and Encryption: In some embodiments, compression and        encryption policies may be used to group data together, such        that data subject to similar encryption and/or compression        requirements may be grouped together. However, in other        embodiments, the policies may be disregarded when grouping data        for movement to sequential storage. That is, in some        embodiments, data subject to different encryption and/or        compression requirements may be stored on same disks, segments,        or tracks, as these policies may not affect the access pattern        and/or lifetime of the data.

With continued reference to FIG. 1, data may generally be read asneeded, whether it is stored in the flash storage 102 and sequentialstorage 104. However, in some embodiments, data in sequential storage104 may be transferred back to the flash storage 102 as desired orneeded. For example, when a policy and/or tagging indicates that a groupof data may be subject to frequent reads and/or writes in the nearfuture, the group of data may be moved to flash storage 102. Moreover,in some embodiments, data may be moved or replicated to cloud storage108 and/or other storage types or devices. For example, archived datamay be moved to cloud storage 108 in some embodiments.

Turning now to FIG. 2, a system 200 of the present disclosure is shown.The system 200 may generally include an I/O manager 204, an SSD storagedevice 206, a data organizer 208, a segment manager 212, and asequential storage device 214. In some embodiments, the system 200 mayinclude additional and/or alternative components. The system 200 may beconfigured to receive I/O requests 202, including read and writerequests, from one or more clients or other users. Users may be local orremote. In some embodiments, the system 200 may receive requests 202from a plurality of remote users.

The I/O manager 204 may be configured for handling and directingincoming read and write requests from one or more clients or otherusers. With respect to write requests, the I/O manager 204 may directwrite requests to the SSD storage 206. In some embodiments, all orsubstantially all write requests may be directed to SSD storage 206. Inother embodiments, a portion of write requests may be directed to SSDstorage 206. With respect to read requests, the I/O manager 204 maydirect requests to the storage location of the data requested. Forexample, where data is stored in SSD storage 206, the I/O manager 204may direct the read request there. Where data is stored in thesequential storage 214, the I/O manager 204 may direct the read requestto sequential storage. In some embodiments, the I/O manager 204 mayoperate to mask the different types or sources of data storage in thesystem. That is, a user may generally not be aware that some data isstored in SSD storage 206 while other data is stored in sequentialstorage 214 and/or other types of storage.

The I/O manager 204 may include only hardware, only software, or acombination of hardware and software. For example, in some embodiments,the I/O manager 214 may include hardware, such as for example acontroller, processor, hardware circuitry, and/or other hardwarecomponents described herein. Hardware circuitry may include receivinghardware circuitry, data accessing or retrieving hardware circuitry,sending hardware circuitry, or other hardware circuitry. The controller,processer, hardware circuitry, and/or other hardware components may beconfigured to run or operate one or more software programs orapplications for receiving data and communicating data to the SSDstorage 206, sequential storage 214, and/or other storage or othercomponents of the system. Moreover, in some embodiments, the I/O manager204 may be described as a layer, component, module, or element of asystem. Such layer, component, module, or element may include hardwareand/or software, as described above, for performing the above-describedoperations of the I/O manager 204.

The SSD storage 206 may include, for example, one or more flash storagedevices. In some embodiments, the SSD storage 206 may include one ormore non-volatile memory express (NVMe) devices, non-volatile randomaccess memory (NVRAM) devices, and/or other types of device or storage.In particular embodiments, the system may include between approximately4 and 24 NVMe SSD devices. In some embodiments, the SSD storage 206 mayinclude more than one database, file system, or object bucket. The SSDstorage 206 may store data for multiple users or clients, or for aparticular user or client. The SSD storage 206 may be provided by, orowned by, a particular client or user. The SSD storage 206 may be remoteand/or local to the users and/or other system components. Further, it isto be appreciated that, while described herein as SSD storage 206, theremay be some embodiments where the SSD storage layer includes storagedevices that are not solid state drives, but that are configured todeliver relatively low latency and relatively high IOPS, similar to someSSD storage devices.

The SSD storage 206 may generally store data until it can be moved tosequential storage 214. In this way, the SSD storage 206 may store datathat is to be grouped or organized into buckets by the data organizer208, as described below. However, it is to be appreciated that the SSDstorage 206 is not being provided as a mere temporary write cache. Thatis, data stored on the SSD storage 206 may remain there for any suitablelength of time, until the data may be grouped with other or similar datafor migration to sequential storage 214. Additionally, in someembodiments, the SSD storage 206 may store other data, such as data thatis frequently accessed and may not be suitable for sequential storage214.

The data organizer 208 may be configured to monitor data being writtento SSD storage 206, organize the data, and write data to the sequentialstorage 214. In some embodiments, the data organizer 208 may group thedata to be moved to sequential storage 214. For example, data having oneor more matching or corresponding tags, metadata, and/or otherattributes may be grouped together and written as a group to sequentialstorage 214. In this way, the data organizer 208 may monitor new writesto SSD storage 206 in order to group corresponding data together to bewritten to sequential storage 214. FIG. 3 illustrates one embodiment ofthe data organizer 208 grouping together similar or corresponding datawrites to be written to sequential storage 214. As shown in FIG. 3, datawrites 306 for two different objects, Object A 302 and Object B 304, maybe written to the system at non-sequential or random times. Moreover,the data writes 306 may be received from a variety of sources. The datawrites 306 for both objects may be written to SSD storage 206 generallyor substantially in the order in which they are received. That is, inSSD storage 206, writes corresponding to the Object A 302 may beadjacent to or intermixed with writes corresponding to Object B 304.However, before the data is written to sequential storage 214, the dataorganizer 208 may group together Object A 302 writes and Object B 304writes. The Object A 302 writes may be written together, and the ObjectB 304 writes may be written together. Additionally the data organizer208 may organize the data writes in any desirable order to increase readperformance, for example.

The data organizer 208 may use one or more algorithms for grouping datawrites in and/or organizing the data writes. For example, and as shownin FIG. 2, the data organizer 208 may conceptually group data into aplurality of data buckets 210. Each data bucket 210 may relate to one ormore data tags, metadata, and/or other data attributes. In this way, thedata organizer 208 may monitor data written to SSD storage 206 todetermine which data bucket 210 the data corresponds with. Data with oneor more of the same tag(s), metadata, and/or other attribute(s) may begrouped together in a same data bucket 210. In some embodiments, datamay be associated with more than one bucket 210 based on its varioustags and/or other attributes. Where data is associated with more thanone bucket 210, the data may be moved to sequential storage 214 with thegroup of data corresponding to the bucket that first fills or firstreaches a quota. Once the data is moved to sequential storage 214, thedata may be removed from any other buckets 210 with which it isassociated. Data buckets 210 may be created automatically in someembodiments. For example, if the data write does not correspond with anydata bucket 210, the data organizer 208 may create a new data bucket.Data buckets 210 may generally correspond with the data that iscurrently in the SSD storage 206 and awaiting transfer to the sequentialstorage 214 at any given time. In other embodiments, data buckets 210may be manually or partially manually created, such as by a user orbased on one or more predefined parameters. It is to be appreciated thatdata buckets 210 may be conceptual groups for identifying data based ontagging or other attributes associated with the data. That is,organizing the data into data buckets 210 may not necessarily includemoving the data or storing the data in a particular location or group.However, in other embodiments, data buckets 210 may be storagecontainers in which data is stored or moved on the SSD storage 206 orother storage.

In some embodiments, data buckets 210 may have data limits or quotas,such that if a data bucket becomes full or otherwise meets a quota, thedata organizer 208 may write the grouped data to sequential storage 214.Quotas of the data buckets 210 may correspond with segment sizes of thesequential storage 214 in some embodiments. For example, if thesequential storage 214 has 256 MB segments, at least some data buckets210 may have quotas or data limits of approximately 256 MB. In this way,when a data bucket 210 having similar or corresponding data (i.e. datahaving at least one matching tag, metadata, and/or other attribute) isfull or nearly full, the data in the data bucket may be written togetheras a segment in sequential storage 214.

The data organizer 208 may group data based on particular data tags andpolicies. In some embodiments, the data organizer 208 may group databased on an order of policies. For example, the data organizer 208 mayfirst group data together based on data protection policies, asdescribed above. The data organizer may next group data based onpriority policies, such that data having same or similar priorityrequirements may be grouped together when written to sequential storage214. Third, the data organizer 208 may group data based on data lifetimepolicies. For example, algorithms may be used to determine when data isconfigured to expire or move based on lifetime policies and creationdates. In some embodiments, a range of dates or times may be used suchthat, for example, all data configured to expire within a particularweek may be grouped together. Fourth, the data organizer 208 may groupdata based on any other polic(ies), tag(s), and/or other attribute(s).For example, the data may be grouped based on project name, creationtime, or access time, as designated by one or more tags or metadata. Inother embodiments, the data may be grouped based on any other suitablepolic(ies) and/or tag(s). Moreover, the policies and/or tags may beconsidered in any suitable order.

FIG. 4 illustrates one embodiment of different data buckets that may beused to sort data writes based on a plurality of data policies. Asshown, a first data bucket 402 may group data writes subject to a highpriority policy, three disk failure data protection policy, and a twoyear lifetime. A second data bucket 404 may group data writes subject toa high priority policy, three disk failure data protection policy, and aone year lifetime. A third data bucket 406 may group data writes subjectto a medium priority policy, three disk failure data protection policy,and a three year lifetime. A fourth data bucket 408 may group datawrites based on a low priority policy, two disk failure data protectionpolicy, and a four year lifetime. Data within each bucket may be writtensequentially to one or more segments in sequential storage 214.

When a data bucket quota is met, or when data in SSD storage 206 isotherwise ready to move to sequential storage 214, the data organizer208 may transfer or initiate transfer of the data from SSD storage tosequential storage. When data is written to sequential storage 214, itmay be removed from SSD storage 206 in some embodiments. In someembodiments, the data organizer 208 may transfer grouped data, or datarelated to a same object or file, or data that may be accessed togetheror substantially together, to a minimal number of physical disklocations. That is, when possible due to parity and priority parameters,available space, and other factors, grouped data may be placed on asingle physical disk to minimize a total number of I/Os necessary toretrieve the group of data. In some embodiments, larger groups, objects,or files may be divided onto multiple disks to improve read performance.

In some embodiments, the data organizer 208 may additionally beconfigured to transfer data from sequential storage 214 to SSD storage206. For example, one or more access patterns, tags, policies, and/ormetadata attributes may designate that data should be moved to SSDstorage 206 at a predetermined time. The data organizer 208 maydetermine when the data should be moved from sequential storage 214 toSSD storage 206, and may move the data as needed. If the data is laterno longer needed on SSD storage 206, the data organizer 208 may move thedata back to sequential storage 214. In some embodiments, the data maybe stored in a different location when it is returned to sequentialstorage 214, and may be grouped with different data, such as in adifferent bucket 210. Moreover, the data organizer 208 may additionallybe configured to transfer data to cloud storage and/or other storagedevices or types. In some embodiments, cloud storage may be used forarchival data and/or other data needs. Moreover, other storage typesand/or devices may be used in a system of the present disclosure. Thedata organizer 208 may move data among these different storage locationsas needed or as defined by tagging and/or policies, for example.

The data organizer 208 may include only hardware, only software, or acombination of hardware and software. For example, in some embodiments,the data organizer 208 may include hardware, such as for example acontroller, processor, hardware circuitry, and/or other hardwarecomponents described herein. Hardware circuitry may include receivinghardware circuitry, data organizing hardware circuitry, data groupinghardware circuitry, data bucket hardware circuitry, data monitoringhardware circuitry, data storing hardware circuitry, sending hardwarecircuitry, or other hardware circuitry. The controller, processer,hardware circuitry, and/or other hardware components may be configuredto run or operate one or more software programs or applications formonitoring data, organizing and/or grouping data, sending data to theSSD storage 206, sequential storage 214, or other storage location,and/or other storage or other components of the system 200. Moreover, insome embodiments, the data organizer 208 may be described as a layer,component, module, or element of a system. Such layer, component,module, or element may include hardware and/or software, as describedabove, for performing the above-described operations of the dataorganizer 208.

With continued reference to FIG. 2, the segment manager 212 may monitorsequential storage 214 to locate, track, or gather free space on thesequential storage. For example, the segment manager 212 may determinewhere there are free, unused, or underused segments on the sequentialstorage 214 that may be written with grouped data from the SSD storage206. The segment manager 212 may notify the data organizer 208 of thisavailable space. In some embodiments, the segment manager 212 may locatesuitable space for a particular data bucket 210 or a particular group ofdata. In some embodiments, the segment manager 212 may locate or trackavailable space based on disk properties or other storage properties.For example, where a data bucket 210 requires data be stored on one ormore disks having particular parity or other properties, the segmentmanager 212 may locate suitable space on one or more disks having thedesired properties.

The segment manager 212 may include only hardware, only software, or acombination of hardware and software. For example, in some embodiments,the segment manager 212 may include hardware, such as for example acontroller, processor, hardware circuitry, and/or other hardwarecomponents described herein. Hardware circuitry may include receivinghardware circuitry, storage space locating hardware circuitry, or otherhardware circuitry. The controller, processer, hardware circuitry,and/or other hardware components may be configured to run or operate oneor more software programs or applications for monitoring or locatingavailable storage space, determining storage space attributes,communicating with the data organizer 208 and sequential storage 214,and/or other storage or other components of the system 200. Moreover, insome embodiments, the segment manager 212 may be described as a layer,component, module, or element of a system. Such layer, component,module, or element may include hardware and/or software, as describedabove, for performing the above-described operations of the segmentmanager 212.

The sequential storage 214 may include, for example, one or moreshingled magnetic recording (SMR) storage devices. Additionally oralternatively, the sequential storage 214 may include other sequential,semi-sequential, or partially sequential storage devices. Sequentialstorage 214 may include tap or one or more subsystems containing tape insome embodiments. Sequential storage 214 may be separable into segments,zones, stripes, or other discrete portions that may be written as aunit. As described above, data may be grouped together, such that asequential storage 214 unit may be written simultaneously. In someparticular embodiments, the system 200 may include between approximately30 and 120 SMR devices. In some embodiments, the sequential storage 214may include more than one database, file system, or object bucket. Thesequential storage 214 may store data for multiple users or clients, orfor a particular user or client. The sequential storage 214 may beprovided by, or owned by, a particular client or user. The sequentialstorage may be remote and/or local to the users and/or other systemcomponents. Further, it is to be appreciated that, while describedherein as sequential storage 214, there may be some embodiments wherethe sequential storage layer includes storage devices that are notsequential storage devices, but that may generally deliver a relativelyhigh latency and/or low IOPS, and/or that are configured to provide arelatively high density of storage space.

In some embodiments, the system 200 may additionally have a garbagecollection engine. The garbage collection engine may include hardwareand/or software to help optimize space in the sequential storage. Forexample, the garbage collection engine may seek stripes or segments thatare ready to update or migrate to other storage. The garbage collectionengine may compact or compress data where possible. In this way, thegarbage collection engine may help to minimize write amplification. Thegarbage collection may perform these operations while retaining thegrouping characteristics of data in the sequential storage. In someembodiments, the garbage collection engine may be part of the segmentmanager. In other embodiments, the garbage collection engine may be aseparate component of the system 200.

Additionally, the system 200 may generally include any instrumentalityor aggregate of instrumentalities operable to compute, calculate,determine, classify, process, transmit, receive, retrieve, originate,switch, store, display, communicate, manifest, detect, record,reproduce, handle, or utilize any form of information, intelligence, ordata for business, scientific, control, or other purposes. For example,the system 200 or any portion thereof may be a minicomputer, mainframecomputer, personal computer (e.g., desktop or laptop), tablet computer,mobile device (e.g., personal digital assistant (PDA) or smart phone) orother hand-held computing device, server (e.g., blade server or rackserver), a network storage device, or any other suitable device orcombination of devices and may vary in size, shape, performance,functionality, and price. The system 200 may include volatile memory(e.g., random access memory (RAM)), one or more processing resourcessuch as a central processing unit (CPU) or hardware or software controllogic, ROM, and/or other types of nonvolatile memory (e.g., EPROM,EEPROM, etc.). A basic input/output system (BIOS) can be stored in thenon-volatile memory (e.g., ROM), and may include basic routinesfacilitating communication of data and signals between components withinthe system. The volatile memory may additionally include a high-speedRAM, such as static RAM for caching data.

Additional components of the system 200 may include one or more diskdrives or one or more mass storage devices, one or more network portsfor communicating with external devices as well as various input andoutput (I/O) devices, such as a keyboard, a mouse, touchscreen and/or avideo display. Mass storage devices may include, but are not limited to,a hard disk drive, floppy disk drive, CD-ROM drive, smart drive, flashdrive, or other types of non-volatile data storage, a plurality ofstorage devices, a storage subsystem, or any combination of storagedevices. A storage interface may be provided for interfacing with massstorage devices, for example, a storage subsystem. The storage interfacemay include any suitable interface technology, such as EIDE, ATA, SATA,and IEEE 1394. The system 200 may include what is referred to as a userinterface for interacting with the system, which may generally include adisplay, mouse or other cursor control device, keyboard, button,touchpad, touch screen, stylus, remote control (such as an infraredremote control), microphone, camera, video recorder, gesture systems(e.g., eye movement, head movement, etc.), speaker, LED, light,joystick, game pad, switch, buzzer, bell, and/or other user input/outputdevice for communicating with one or more users or for enteringinformation into the system. These and other devices for interactingwith the system 200 may be connected to the system through I/O deviceinterface(s) via a system bus, but can be connected by other interfacessuch as a parallel port, IEEE 1394 serial port, a game port, a USB port,an IR interface, etc. Output devices may include any type of device forpresenting information to a user, including but not limited to, acomputer monitor, flat-screen display, or other visual display, aprinter, and/or speakers or any other device for providing informationin audio form, such as a telephone, a plurality of output devices, orany combination of output devices.

The system 200 may also generally include one or more buses operable totransmit communications between the various hardware components. Asystem bus may be any of several types of bus structure that can furtherinterconnect, for example, to a memory bus (with or without a memorycontroller) and/or a peripheral bus (e.g., PCI, PCIe, AGP, LPC, etc.)using any of a variety of commercially available bus architectures.

One or more programs or applications, such as a web browser, applicationprogram interface (API), and/or other executable applications, may bestored in one or more of the system data storage devices. For example,the I/O manager 204, data organizer 208, and segment manager 212 may beor include programs or applications stored in, and configured to run orexecute on, the system 200. Generally, programs may include routines,methods, data structures, other software components, etc., that performparticular tasks or implement particular abstract data types. Programsor applications may be loaded in part or in whole into a main memory orprocessor during execution by the processor. One or more processors mayexecute applications or programs to run systems or methods of thepresent disclosure, or portions thereof, stored as executable programsor program code in the memory, or received from the Internet or othernetwork. Any commercial or freeware web browser or other applicationcapable of retrieving content from a network and displaying pages orscreens may be used. In some embodiments, a customized application maybe used to access, display, and update information. A user may interactwith the system, programs, and data stored thereon or accessible theretousing any one or more of the input and output devices described above.

The system 200 may operate in a networked environment using logicalconnections via a wired and/or wireless communications subsystem to oneor more networks and/or other computers. Other computers can include,but are not limited to, workstations, servers, routers, personalcomputers, microprocessor-based entertainment appliances, peer devices,or other common network nodes, and may generally include many or all ofthe elements described above. Logical connections may include wiredand/or wireless connectivity to a local area network (LAN), a wide areanetwork (WAN), hotspot, a global communications network, such as theInternet, and so on. The system 200 may be operable to communicate withwired and/or wireless devices or other processing entities using, forexample, radio technologies, such as the IEEE 802.xx family ofstandards, and includes at least Wi-Fi (wireless fidelity), WiMax, andBluetooth wireless technologies. Communications can be made via apredefined structure as with a conventional network or via an ad hoccommunication between at least two devices. In some embodiments, some orall of the components, applications, or programs of the system 200 orany system of the present disclosure may be provided as cloud-basedcomponents, or may be otherwise provided by, executed on, or supportedby, a cloud system.

Turning now to FIG. 5, a method 500 for mapping random access datawrites to sequential storage, which may be performable by systems of thepresent disclosure, is shown. The method 500 may include the steps ofreceiving a write request 502; writing the data for the write request toSSD storage 504; grouping SSD data into data buckets 506; when a databucket reaches a quota, moving the data to sequential storage 508; andperforming applicable data policy operations with respect to the moveddata 510. In other embodiments, the method may include additional oralternative steps.

Receiving a write request 502 may include receiving a request to writenew data or modify data. The request may be received from one or moreremote or local clients or other users or systems. In some embodiments,as described above, the write request may be received by an I/O manageror another component of a system of the present disclosure. The datarelated to the write request may be written to SSD storage 504, such asflash storage or another suitable storage location. In the SSD storage,the data may be grouped into one or more data buckets 506. As describedabove, a data bucket may be a group of data that contains similartagging, metadata, and/or other attributes. The data may remain in SSDstorage until it can be grouped with other data and written tosequential storage. In this way, the data may remain in SSD storage forgenerally any suitable amount of time until there is enough data havingsimilar tagging or other attributes to send to sequential storage. Oncea data bucket reaches a predetermined quota or threshold, or it isotherwise determined that data in the bucket is suitable for migration,the data in the bucket may be moved to sequential storage 508. Asdescribed above, the data may be written as a segment to available spacein the sequential storage. Once the data is written to sequentialstorage, it may be removed from the SSD storage.

Additionally, the method 500 may include performing any applicablepolicy operations associated with the data 510. For example, the datamay be subject to a policy requiring migration of the data back to SSDstorage at a particular time and/or for a particular period of time.Similarly, the data may be subject to a policy requiring migration tocloud storage, or requiring deletion of the data at a particular time orafter a particular time. These policy operations may be performed asprescribed by any policies associated with the data.

Moreover, one or more policy operations may be maintained 512.Maintaining policy operations may include performing additionaloperations, such as where a policy requires continuous or repeatedoperations or requirements. Maintaining policy operations mayadditionally include revising operations or requirements in response topolicy modifications. That is, where a policy is modified, maintainingpolicy operations may include ensuring that updated or revisedoperations are performed with respect to previously tagged data.

Systems and methods of the present disclosure may generally provide forcost-effective data storage, particularly where large quantities of dataare stored, together with relatively fast IOPS performance. Thesesystems and methods may provide for leveraging of relatively high-speedSSD or other storage devices, while serving relatively high-bandwidthapplications for large data sets, making use of the space efficiencysequential storage. The SSD storage described herein may operate as abuffer layer, allowing the system to collect and organize random userwrites before writing segments to sequential storage. Read latency ofthe system may be reduced by storing like data within a same segment ofthe sequential storage, and minimizing a number of physical disks onwhich like data is stored. As described above, tagging may providecontextual information from which the data organizer may group likedata. Moreover, write latency may be reduced by directing incomingwrites to SSD or other relatively high-performing random access datastorage. Write amplification may also be reduced by grouping like datatogether, such that a segment of data may be updated together. Ingeneral, a user of the systems and methods described herein may beunaware of the different layers of data storage. That is, a user may beunaware of the SSD layer where data is stored and gathered before it iswritten to sequential storage.

Hardware and software components of the present disclosure, as discussedherein, may be integral portions of a single computer or server or maybe connected parts of a computer network. The hardware and softwarecomponents may be located within a single location or, in otherembodiments, portions of the hardware and software components may bedivided among a plurality of locations and connected directly or througha global computer information network, such as the Internet.Accordingly, aspects of the various embodiments of the presentdisclosure can be practiced in distributed computing environments wherecertain tasks are performed by remote processing devices that are linkedthrough a communications network. In such a distributed computingenvironment, program modules may be located in local and/or remotestorage and/or memory systems.

As will be appreciated by one of skill in the art, the variousembodiments of the present disclosure may be embodied as a method(including, for example, a computer-implemented process, a businessprocess, and/or any other process), apparatus (including, for example, asystem, machine, device, computer program product, and/or the like), ora combination of the foregoing. Accordingly, embodiments of the presentdisclosure may take the form of an entirely hardware embodiment, anentirely software embodiment (including firmware, middleware, microcode,hardware description languages, etc.), or an embodiment combiningsoftware and hardware aspects. Furthermore, embodiments of the presentdisclosure may take the form of a computer program product on acomputer-readable medium or computer-readable storage medium, havingcomputer-executable program code embodied in the medium, that defineprocesses or methods described herein. A processor or processors mayperform the necessary tasks defined by the computer-executable programcode. Computer-executable program code for carrying out operations ofembodiments of the present disclosure may be written in an objectoriented, scripted or unscripted programming language such as Java,Perl, PHP, Visual Basic, Smalltalk, C++, or the like. However, thecomputer program code for carrying out operations of embodiments of thepresent disclosure may also be written in conventional proceduralprogramming languages, such as the C programming language or similarprogramming languages. A code segment may represent a procedure, afunction, a subprogram, a program, a routine, a subroutine, a module, anobject, a software package, a class, or any combination of instructions,data structures, or program statements. A code segment may be coupled toanother code segment or a hardware circuit by passing and/or receivinginformation, data, arguments, parameters, or memory contents.Information, arguments, parameters, data, etc. may be passed, forwarded,or transmitted via any suitable means including memory sharing, messagepassing, token passing, network transmission, etc.

In the context of this document, a computer readable medium may be anymedium that can contain, store, communicate, or transport the programfor use by or in connection with the systems disclosed herein. Thecomputer-executable program code may be transmitted using anyappropriate medium, including but not limited to the Internet, opticalfiber cable, radio frequency (RF) signals or other wireless signals, orother mediums. The computer readable medium may be, for example but isnot limited to, an electronic, magnetic, optical, electromagnetic,infrared, or semiconductor system, apparatus, or device. More specificexamples of suitable computer readable medium include, but are notlimited to, an electrical connection having one or more wires or atangible storage medium such as a portable computer diskette, a harddisk, a random access memory (RAM), a read-only memory (ROM), anerasable programmable read-only memory (EPROM or Flash memory), acompact disc read-only memory (CD-ROM), or other optical or magneticstorage device. Computer-readable media includes, but is not to beconfused with, computer-readable storage medium, which is intended tocover all physical, non-transitory, or similar embodiments ofcomputer-readable media.

Various embodiments of the present disclosure may be described hereinwith reference to flowchart illustrations and/or block diagrams ofmethods, apparatus (systems), and computer program products. It isunderstood that each block of the flowchart illustrations and/or blockdiagrams, and/or combinations of blocks in the flowchart illustrationsand/or block diagrams, can be implemented by computer-executable programcode portions. These computer-executable program code portions may beprovided to a processor of a general purpose computer, special purposecomputer, or other programmable data processing apparatus to produce aparticular machine, such that the code portions, which execute via theprocessor of the computer or other programmable data processingapparatus, create mechanisms for implementing the functions/actsspecified in the flowchart and/or block diagram block or blocks.Alternatively, computer program implemented steps or acts may becombined with operator or human implemented steps or acts in order tocarry out an embodiment of the invention.

Additionally, although a flowchart or block diagram may illustrate amethod as comprising sequential steps or a process as having aparticular order of operations, many of the steps or operations in theflowchart(s) or block diagram(s) illustrated herein can be performed inparallel or concurrently, and the flowchart(s) or block diagram(s)should be read in the context of the various embodiments of the presentdisclosure. In addition, the order of the method steps or processoperations illustrated in a flowchart or block diagram may be rearrangedfor some embodiments. Similarly, a method or process illustrated in aflow chart or block diagram could have additional steps or operationsnot included therein or fewer steps or operations than those shown.Moreover, a method step may correspond to a method, a function, aprocedure, a subroutine, a subprogram, etc.

As used herein, the terms “substantially” or “generally” refer to thecomplete or nearly complete extent or degree of an action,characteristic, property, state, structure, item, or result. Forexample, an object that is “substantially” or “generally” enclosed wouldmean that the object is either completely enclosed or nearly completelyenclosed. The exact allowable degree of deviation from absolutecompleteness may in some cases depend on the specific context. However,generally speaking, the nearness of completion will be so as to havegenerally the same overall result as if absolute and total completionwere obtained. The use of “substantially” or “generally” is equallyapplicable when used in a negative connotation to refer to the completeor near complete lack of an action, characteristic, property, state,structure, item, or result. For example, an element, combination,embodiment, or composition that is “substantially free of” or “generallyfree of” an element may still actually contain such element as long asthere is generally no significant effect thereof.

In the foregoing description various embodiments of the presentdisclosure have been presented for the purpose of illustration anddescription. They are not intended to be exhaustive or to limit theinvention to the precise form disclosed. Obvious modifications orvariations are possible in light of the above teachings. The variousembodiments were chosen and described to provide the best illustrationof the principals of the disclosure and their practical application, andto enable one of ordinary skill in the art to utilize the variousembodiments with various modifications as are suited to the particularuse contemplated. All such modifications and variations are within thescope of the present disclosure as determined by the appended claimswhen interpreted in accordance with the breadth they are fairly,legally, and equitably entitled.

We claim:
 1. A data storage system comprising: a first storage layercomprising a first type of storage device; a second storage layercomprising a second type of storage device different from the firsttype; an I/O manager directing incoming write requests to the firststorage layer; and a data organizer: organizing the data stored on thefirst storage layer into data buckets, wherein a data bucket comprisesdata having at least one similar attribute; and when a data bucketreaches a quota, moving the data in the bucket from the first storagelayer to the second storage layer.
 2. The data storage system of claim1, wherein the first storage layer comprises one or more solid statedrives.
 3. The data storage system of claim 2, wherein the first storagelayer comprises one or more flash storage devices.
 4. The data storagesystem of claim 3, wherein the second storage layer comprises one ormore sequential or semi-sequential storage devices.
 5. The data storagesystem of claim 4, wherein the second storage layer comprises one ormore shingled magnetic recording devices.
 6. The data storage system ofclaim 1, wherein organizing the data stored on the first storage layerinto data buckets comprises reviewing one or more tags associated withthe data to determine the at least one similar attribute.
 7. The datastorage system of claim 6, wherein the at least one attribute relates toa data lifetime policy.
 8. The data storage system of claim 6, whereinthe at least one attribute relates to a data priority policy.
 9. Thedata storage system of claim 6, wherein the at least one attributerelates to a data protection policy.
 10. The data storage system ofclaim 6, wherein the at least one attribute relates to temporallocality.
 11. The data storage system of claim 1, wherein the I/Omanager additionally directs incoming read requests to either of thefirst storage layer and the second storage layer, depending on where therelevant data is stored.
 12. The data storage system of claim 1, whereinthe data organizer additionally moves data from the second storage layerto the first storage layer based on one or more policies.
 13. The datastorage system of claim 1, further comprising a segment managersearching the second storage layer for available storage space.
 14. Thedata storage system of claim 8, wherein the segment manager maintains arecord of available space on the second storage layer.
 15. A method forstoring data, the method comprising: receiving a write request for data;writing the data to a first storage layer comprising a first type ofstorage device; grouping the data with data having at least one similarattribute; and moving the grouped data to a second storage layercomprising a second type of storage device.
 16. The method of claim 15,further comprising performing a data policy operation with respect tothe grouped data.
 17. The method of claim 15, wherein grouping the datawith data having at least one similar attribute comprises placing thedata in a data bucket based on one or more tags associated with thedata.
 18. The method of claim 17, wherein the one or more tags relate toat least one of a data lifetime policy, a data priority policy, a dataprotection policy, and temporal locality.
 19. A data handling systemcomprising: an I/O manager directing incoming write requests to a firststorage layer, the first storage layer comprising a first type of datastorage device; and a data organizer: organizing the data stored on thefirst storage layer into data buckets, wherein a data bucket comprisesdata having at least one similar attribute; and when a data bucketreaches a quota, moving the data in the bucket from the first storagelayer to a second storage layer, the second storage layer comprising asecond type of data storage device different from the first type. 20.The data handling system of claim 19, wherein organizing the data storedon the first storage layer into data buckets comprises reviewing one ormore tags associated with the data.